Cryptographic Protocol Verification via Supercompilation
نویسندگان
چکیده
It has been known for a while [35, 36, 12] that program transformation techniques, in particular, program specialization, can be used to prove the properties of programs automatically. For example, if a program actually implements (in a given context of use) a constant function sufficiently powerful and semantics preserving program transformation may reduce the program to a syntactically trivial “constant” program, pruning unreachable branches and proving thereby the property. Viability of such an approach to verification has been demonstrated in previous works [16, 19, 18] where it was applied to the verification of parameterized cache coherence protocols and Petri Nets models [11, 20]. In this paper we further extend the method and present a case study on its application to the verification of a cryptographic protocol. The protocol is modeled by functional programs at different levels of abstraction and verification via program specialization is done by using Turchin’s supercompilation method.
منابع مشابه
Automatic Verification of Counter Systems via Domain- Specific Multi-result Supercompilation Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation. Keldysh Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation Moscow 2012
matic verification of counter systems via domain-specific multi-result supercompilation We consider an application of supercompilation to the analysis of counter transition systems. Multi-result supercompilation enables us to find the best versions of the analysis by generating a set of possible results that are then filtered according to some criteria. Unfortunately, the search space may be ra...
متن کاملVerification as Specialization of Interpreters with Respect to Data
In the paper we explain the technique of verification via supercompliation taking as an example verification of the parameterised Load Balancing Monitor system. We demonstrate detailed executable specification of the Load Balancing Monitor protocol in a functional programming language REFAL and discuss the result of its supercompilation by the supercompiler SCP4. This case study is interesting ...
متن کاملAutomatic verification of counter systems via domain-specific multi-result supercompilation (2012)
matic verification of counter systems via domain-specific multi-result supercompilation We consider an application of supercompilation to the analysis of counter transition systems. Multi-result supercompilation enables us to find the best versions of the analysis by generating a set of possible results that are then filtered according to some criteria. Unfortunately, the search space may be ra...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012